منابع مشابه
Time-Constrained Graph Pattern Matching in a Large Temporal Graph
Graph pattern matching(GPM) is an important operation on graph computation. Most existing work assumes that query graph or data graph is static, which is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching(TCGPM) in a large temporal graph. Different from traditional work, our work ...
متن کاملPreference-constrained Oriented Matching
We introduce and study a combinatorial problem called preference-constrained oriented matching. This problem is defined on a directed graph in which each node has preferences over its out-neighbors, and the goal is to find a maximum-size matching on this graph that satisfies a certain preference constraint. One of our main results is a structural theorem showing that if the given graph is compl...
متن کاملApproximate Constrained Subgraph Matching
Our goal is to build a declarative framework for approximate graph matching where various constraints can be stated upon the pattern graph, enabling approximate constrained subgraph matching, extending models and constraints proposed by Rudolf [1] and Valiente et al. [2]. In the present work, we propose a CSP approach for approximate subgraph matching where the potential approximation is declar...
متن کاملMatching-Constrained Active Contours
In object segmentation by active contours, the initial contour is often required. Conventionally, the initial contour is provided by the user. This paper extends the conventional active contour model by incorporating feature matching in the formulation, which gives rise to a novel matching-constrained active contour. The numerical solution to the new optimization model provides an automated fra...
متن کاملPattern Matching
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques, and how simpler patterns can be dealt with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2011
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1921659.1921671